Self-stabilizing local k-placement of replicas with local minimum variance
نویسندگان
چکیده
منابع مشابه
Self-Stabilizing Distributed Local Mutual Exclusion
A self-stabilizing system is a system such that it autonomously converges to a legitimate system state, regardless of the initial system state. The local mutual exclusion problem is the problem of guaranteeing that no two processes neighboring each other execute their critical sections at a time. The process identifiers are said to be chromatic if no two processes neighboring each other have th...
متن کاملA Local Self-stabilizing Enumeration Algorithm
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] presented the first self-stabilizing version of this algorithm which tolerates transient failures with an extension of messages complexity. Our version is based on local detection and correction of transient failures. ...
متن کاملOn the Self-stabilization of Mobile Oblivious Robots in Uniform Rings
Self-stabilizing local k-placement of replicas with minimal variance. Self-stabilizing algorithm for maximal graph partitioning into triangles.
متن کاملLinear statistical inference for global and local minimum variance portfolios
Traditional portfolio optimization has been often criticized since it does not account for estimation risk. Theoretical considerations indicate that estimation risk is mainly driven by the parameter uncertainty regarding the expected asset returns rather than their variances and covariances. This is also demonstrated by several numerical studies. The global minimum variance portfolio has been a...
متن کاملA Self-stabilizing and Local Delaunay Graph Construction
This paper studies the construction of self-stabilizing topologies for distributed systems. While recent research has focused on chain topologies where nodes need to be linearized with respect to their identifiers, we go a step further and explore a natural 2-dimensional generalization. In particular, we present a local self-stabilizing algorithm that constructs a Delaunay graph from any initia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.04.019